Decidability Issues for Petri Nets
نویسندگان
چکیده
This is a survey of some decidability results for Petri nets, covering the last three decades. The presentation is structured around decidability of specific properties, various behavioural equivalences and finally the model checking problem for temporal logics.
منابع مشابه
Decidability Issues for Petri Nets { a Survey 1
We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics.
متن کاملContinuous Petri Nets: Expressive Power and Decidability Issues
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models. The expected gains are twofold: improvements in comlexity and in decidability. This paper concentrates on the study of decidability issues. In the case of autonomous nets it is proved that properties like reachability, liveness o...
متن کاملObject Petri Nets: Definitions, Properties, and Related Models
In this presentation the decidability issues of formalisms that allow Petri nets as tokens are studied. Especially for “elementary object-net systems” defined by Valk the decidability of the reachability and the boundedness problem is considered. It is shown that reachability becomes undecidable while boundedness remains decidable for elementary object-net systems. Furthermore it is shown that ...
متن کاملDecidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
In Petri nets with data, every token carries a data value, and executability of a transition is conditioned by a relation between data values involved. Decidability status of various decision problems for Petri nets with data may depend on the structure of data domain. For instance, if data values are only tested for equality, decidability status of the reachability problem is unknown (but deci...
متن کاملDecidable Classes of Unbounded Petri Nets with Time and Urgency
Adding real time information to Petri net models often leads to undecidability of classical verification problems such as reachability and boundedness. For instance, models such as Timed-Transition Petri nets (TPNs) [22] are intractable except in a bounded setting. On the other hand, the model of TimedArc Petri nets [26] enjoys decidability results for boundedness and control-state reachability...
متن کامل